In mathematics, the Hardy–Littlewood maximal operator M is a significant non-linear operator used in real analysis and harmonic analysis. It takes a function ƒ (a complex-valued and locally integrable function)
and returns a second function
that, at each point x ∈ Rd, gives the maximum average value that ƒ can have on balls centered at that point. More precisely,
where
is the ball of radius centered at x, and md denotes the d-dimensional Lebesgue measure.
The averages are jointly continuous in x and r, therefore the maximal function Mf, being the supremum over r > 0, is measurable. It is not obvious that Mf is finite almost everywhere. This is a corollary of the Hardy–Littlewood maximal inequality
Contents |
This theorem of G. H. Hardy and J. E. Littlewood states that M is bounded as a sublinear operator from the Lp space
to itself. That is, if
then the maximal function Mf is weak L1 bounded and
More precisely, for all dimensions d ≥ 1 and 1 < p ≤ ∞, and all ƒ ∈ L1(Rd), there is a constant Cd > 0 such that for all λ > 0, we have the weak type-(1,1) bound:
This is the Hardy–Littlewood maximal inequality.
With the Hardy–Littlewood maximal inequality in hand, the following strong-type estimate is an immediate consequence of the Marcinkiewicz interpolation theorem: there exists a constant Ap,d > 0 such that
Subsequent work by Elias Stein used the Calderón-Zygmund method of rotations to show that one could pick Ap,d = Ap independent of d.[1][2] The best bounds for Ap,d are unknown.[2]
While there are several proofs of this theorem, a common one is given below: For p = ∞, (see Lp space for definition of L∞) the inequality is trivial (since the average of a function is no larger than its essential supremum). For 1 < p < ∞, first we shall use the following version of the Vitali covering lemma to prove the weak-type estimate. (See the article for the proof of the lemma.)
Assuming the lemma for a moment, we complete the proof. For simplicity, we write for a measurable set E and to denote the set . If , then, by definition, we can find a ball centered at x such that
By the lemma, we can find, among such balls, a sequence of balls such that the union of covers . It follows:
This completes the proof of the weak-type estimate. We next deduce from this the bounds. Define by if and else. By the weak-type estimate applied to b, we have:
Then
which is, by the estimate above, bounded by
where the constant depends only on and . This completes the proof of the theorem.
Some applications of the Hardy–Littlewood Maximal Inequality include proving the following results:
Here we use a standard trick involving the maximal function to give a quick proof of Lebesgue differentiation theorem. (But remember that in the proof of the maximal theorem, we used the Vitali covering lemma.) Let and
where we wrote We write where is continuous and has compact support and with norm that can be made arbitrary small. Then
by continuity. Now, and so, by the theorem, we have:
Now, we can let and conclude a.e.; that is, exists for almost all . It remains to show the limit actually equals . But this is easy: it is known that (approximation of the identity) and thus there is a subsequence a.e.. By the uniqueness of limit, a.e. then.
It is still unknown what the smallest constants Ap,d and Cd are in the above inequalities. However, a result of Elias Stein about spherical maximal functions can be used to show that, for 1 < p< ∞, we can remove the dependence of Ap,d on the dimension, that is, Ap,d = Ap for some constant Ap > 0 only depending on the value p. It is unknown whether there is a weak bound that is independent of dimension.